Disjoint Segments with Maximum Density
نویسندگان
چکیده
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities is maximized. We give the first known polynomial-time algorithm for the problem: For general k, our algorithm runs in O(n k) time. For the special case with k = 2 (respectively, k = 3), we also show how to solve the problem in O(n) (respectively, O(n+ )) time.
منابع مشابه
Nonparametric Spectral Analysis on Disjoint Segments of Observations
This paper presents a new approach to estimate the spectral density matrix of a strictly stationary r-vector valued time series in the case where there are some randomly missing observations. The modified series is defined and is used to construct the finite Fourier transform in L-disjoint segments of observations. The modified periodogram is defined and the spectral density estimate is constru...
متن کاملDefinitions and Algorithms in SEGID
Given a (multiple) sequence alignment, SEGID first converts it into a sequence of numbers, where each number is the alignment score of a column. (SEGID also directly accepts a sequence of numbers as input.) Then it provides three algorithms to identify conserved segments (high score substrings): 1. Longest segment (with average value lower bound): given a string of numbers and a number A, find ...
متن کاملEvery Set of Disjoint Line Segments Admits a Binary
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist conngurations of line segments where any such tree requires degree 3. We provide an O(n log n) time a...
متن کاملA Ramsey-type Result for Convex Sets
Given a family of n convex compact sets in the plane, one can always choose n of them which are either pairwise disjoint or pairwise intersecting. On the other hand, there exists a family of n segments in the plane such that the maximum size of a subfamily with pairwise disjoint or pairwise intersecting elements in n*"* ^ n-.
متن کاملPointed Binary Encompassing Trees
We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T , that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v ∈ T is pointed, that is, v has an incident angle greater than π. Such a tree can be completed to a minimum pseudo-triangulation. In particular, it follo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005